Homotopy and Concurrency
نویسنده
چکیده
In this paper we give a homotopy theoretic proof of a well-known result in database engineering: that 2-phase locking is safe. The proof gives an immediate intuitive reason for why the 2-phase locking condition implies safety. We point out a number of interesting open questions regarding the interplay between homotopy and concurrency.
منابع مشابه
Modeling Concurrency with Geometry bY
The phenomena of branching time and true or noninterleaving concurrency find their respective homes in automata and schedules. But these two models of computation are formally equivalent via Birkhoff duality, an equivalence we expound on here in tutorial detail. So why should these phenomena prefer one over the other? We identify dimension as the culprit: l-dimensional automata are skeletons pe...
متن کاملHomotopical Methods for Theoretical Computer Science
The purpose of this paper is to collect the homotopical methods used in the development of the theory of flows initialized by author’s paper “A model category for the homotopy theory of concurrency”. It is presented generalizations of the classical Whitehead theorem inverting weak homotopy equivalences between CW-complexes using weak factorization systems. It is also presented methods of calcul...
متن کاملHomotopy Bisimilarity for Higher-Dimensional Automata
We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional automata into higher-dimensional trees. Using a notion of open maps in this category, we define homotopy bisimilarity. We show that homotopy bisimilarity is eq...
متن کاملThe Directed Homotopy Hypothesis
The homotopy hypothesis was originally stated by Grothendieck [13] : topological spaces should be “equivalent” to (weak) ∞-groupoids, which give algebraic representatives of homotopy types. Much later, several authors developed geometrizations of computational models, e.g. for rewriting, distributed systems, (homotopy) type theory etc. But an essential feature in the work set up in concurrency ...
متن کاملRelative Directed Homotopy Theory of Partially Ordered Spaces
Algebraic topological methods have been used successfully in concurrency theory, the domain of theoretical computer science that deals with parallel computing. L. Fajstrup, E. Goubault, and M. Raussen have introduced partially ordered spaces (pospaces) as a model for concurrent systems. In this paper it is shown that the category of pospaces under a fixed pospace is both a fibration and a cofib...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994